/*
decimal system
As we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 9, we just import 3 and 9.after calculation of computer, we will get the result of 12.
But after learning <<The Principle Of Computer>>,we know that the computer will do the calculation as the following steps:
1 computer change the 3 into binary formality like 11;
2 computer change the 9 into binary formality like 1001;
3 computer plus the two number and get the result 1100;
4 computer change the result into decimal formality like 12;
5 computer export the result;
In the computer system there are other formalities to deal with the number such as hexadecimal. Now I will give several number with a kind of change method, for example, if I give you 1011(2), it means 1011 is a number in the binary system, and 123(10) means 123 if a number in the decimal system. Now I will give you some numbers with any kind of system, you guys should tell me the sum of the number in the decimal system.
Input
There will be several cases. The first line of each case contains one integers N, and N means there will be N numbers to import, then there will be N numbers at the next N lines, each line contains a number with such form : X1….Xn.(Y), and 0<=Xi<Y, 1<Y<=10. I promise you that the sum will not exceed the 100000000, and there will be at most 100 cases and the 0<N<=1000.
Output
There is only one line output case for each input case, which is the sum of all the number. The sum must be expressed using the decimal system.
Sample Input
3
1(2)
2(3)
3(4)

4
11(10)
11(2)
11(3)
11(4)
Sample Output
6
23
题目大意：输入n个数，每个数括号里面表示的是这个数是几进制，括号前面是这个数。
求出所有的数的十进制和。依次把每个数转化为十进制，然后求和即可。
*/
#include <bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define M(n, m) memset(n, m, sizeof(n));
const int INF = 1e9 + 7;
const int maxn = 1e5;
using namespace std;

int n, m, x, sum;
string str, s1, s2;

int Judge(string s)
{
    s1.clear();
    s2.clear();
    int i;
    for (i = 0; s[i] != '('; i ++)
        s1 += s[i];
    for (i ++; str[i] != ')'; i ++)
        s2 += s[i];
    // 表示当前的进制
    x = 0;
    for (int i = 0;i < s2.size();i ++)
        x = x * 10 + (s2[i] - '0');
    int num = 0;
    reverse(s1.begin(), s1.end());
    for (int i = 0;i < s1.size();i ++)
        num += (s1[i] - '0') * (int)pow(x, i);
    return num;
}

int main()
{

    while(~scanf("%d", &n))
    {
        sum = 0;
        for (int i = 0;i < n;i ++)
        {
            cin >> str;
            sum += Judge(str);
        }
        cout << sum << endl;
    }
    return 0;
}
